Semester Report SS 04 of Daniela Kühn

نویسندگان

  • Daniela Kühn
  • Martin Aigner
چکیده

A classical theorem of Dirac states that every graph on n vertices with minimum degree at least n/2 contains a Hamilton cycle. If one seeks an analogue of this result for uniform hypergraphs, then several alternatives suggest themselves. In the following, we will restrict ourselves to 3-uniform hypergraphs H. Thus each hyperedge of H consists of precisely 3 vertices. A natural way to extend the notion of the minimum degree of a graph to that of a 3-uniform hypergraph H is the following. Given two distinct vertices x and y of H, the neighbourhood N(x, y) of x and y in H is the set of all those vertices z which form a hyperedge together with x and y. The minimum degree δ(H) is defined to be the minimum |N(x, y)| over all pairs of vertices of H. A 3-uniform hypergraph C is called a tight cycle if C has at least 4 vertices and if there is a cyclic ordering of the vertices of C such that every 3 consecutive vertices form a hyperedge of C and C contains no other hyperedges. Note that the cyclic ordering of the vertices of C induces a cyclic ordering of the hyperedges of C.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scintigraphic evaluation of multifocal osteolytic lesions in a patient with primary hyperparathyroidism: A case report

Osteitis fibrosa cystica is the classic patognomonic form of skeletal disease in hyperparathyroidism that characterizes with decreased cortical bone thickness compared to increased cancellous bone. We present a case of 52-year old female patient with osteolysis of the left calf on radiographic images. The bone scan detected multiple focal pathological accumulations in the skull, left tibia, bot...

متن کامل

Embedding cycles of given length in oriented graphs

Kelly, Kühn and Osthus conjectured that for any ` ≥ 4 and the smallest number k ≥ 3 that does not divide `, any large enough oriented graph G with δ(G), δ−(G) ≥ b|V (G)|/kc+1 contains a directed cycle of length `. We prove this conjecture asymptotically for the case when ` is large enough compared to k and k ≥ 7. The case when k ≤ 6 was already settled asymptotically by Kelly, Kühn and Osthus.

متن کامل

Variance of Mouse in the Activity of Complement the Fourth Component

FUKUOKA, Y., OKUDA, T. and TACHIBANA, T. Variance in the Activity o f the Fourth Component of Mouse Complement. Tohoku J. exp. Med., 1983, 141 (2), 225-235 There are two methods for hemolytic titration of 04. One is a method using EACIgP, °XyC2hu and EDTA-CSP (E-C method) and the other using EACIgP, oxyC2hu and C4DSP (C4D mehtod). The 04 titers obtained by these two methods differed depending o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003